Churn Tolerance Improvement Techniques in an Algorithm-Neutral DHT
نویسنده
چکیده
Churn resilience is an important topic in DHT research. In this paper, I present techniques to improve churn resilience and their effects. All the techniques can be implemented in a DHT layer and require no change to underlying routing layers. In other words, they do not depend on a specific routing algorithm and can work with various algorithms.
منابع مشابه
Churn-Resilient Replication Strategy for Peer-to-Peer Distributed Hash-Tables
DHT-based P2P systems provide a fault-tolerant and scalable mean to store data blocks in a fully distributed way. Unfortunately, recent studies have shown that if connection/disconnection frequency is too high, data blocks may be lost. This is true for most current DHTbased system’s implementations. To avoid this problem, it is necessary to build really efficient replication and maintenance mec...
متن کاملA Hybrid Peer-to-Peer Lookup Service Algorithm on Distributed Hash Table
An application using a distributed hash table (DHT) with N nodes must choose a DHT protocol from the spectrum between O(1) lookup protocols and O(logN). However, various applications under different network churns require that an idea DHT would be adaptive in according with the churn rates. ROAD (routing on active and demand), a new lookup algorithm, adjusts itself to provide the best performan...
متن کاملHandling Churn in a DHT
This paper addresses the problem of churn—the continuous process of node arrival and departure—in distributed hash tables (DHTs). We argue that DHTs should perform lookups quickly and consistently under churn rates at least as high as those observed in deployed P2P systems such as Kazaa. We then show through experiments on an emulated network that current DHT implementations cannot handle such ...
متن کاملSet Functionality over DHT Systems
For the last few years, Peer-to-Peer systems were created with the purpose of distributing information across a very large set of hosts. The scalability demands of such systems lead to the design of Distributed Hash Tables algorithms[1, 2, 3, 4], which are capable of locating an object anywhere on the system given a key value using logarithmic (or constant) message hops while maintaining logari...
متن کاملHierarchical Alpha-cut Fuzzy C-means, Fuzzy ARTMAP and Cox Regression Model for Customer Churn Prediction
As customers are the main asset of any organization, customer churn management is becoming a major task for organizations to retain their valuable customers. In the previous studies, the applicability and efficiency of hierarchical data mining techniques for churn prediction by combining two or more techniques have been proved to provide better performances than many single techniques over a nu...
متن کامل